Learning task-optimal image registration with applications in localizing structure and function in the cerebral cortex

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.Cataloged from PDF version of thesis.Includes bibliographical references (p. 127-141).In medical image analysis, registration is necessary to establish spatial correspondences across two or more images. Registration is rarely the end-goal, but instead, the results of image registration are used in other tasks, such as voxel-based morphometry, functional group analysis, image segmentation and tracking. In this thesis, we argue that the quality of image registration should be evaluated in the context of the application. Consequently, we develop a framework for learning registration cost functions optimized for specific tasks. We demonstrate that by taking into account the application, we not only achieve better registration, but also potentially resolve certain ambiguities and ill-posed nature of image registration. We first develop a generative model for joint registration and segmentation of images. By jointly modeling registration and the application of image segmentation, we demonstrate improvements in parcellation of the cerebral cortex into different structural units. In this thesis, we work with spherical representations of the human cerebral cortex. Consequently, we develop a fast algorithm for registering spherical images. Application to the cortex shows that our algorithm achieves state-of-the-art accuracy, while being an order of magnitude faster than competing diffeomorphic, landmark-free algorithms. Finally, we consider the problem of automatically determining the "free" parameters of registration cost functions.(cont.) Registration is usually formulated as an optimization problem with multiple tunable parameters that are manually set. By introducing a second layer of optimization over and above the usual registration, this thesis provides the first effective approach to optimizing thousands of registration parameters to improve alignment of a new image as measured by an application-specific performance measure. Much previous work has been devoted to developing generic registration algorithms, which are then specialized to particular imaging modalities (e.g., MR), particular imaging targets (e.g., cardiac) and particular post- registration analyses (e.g., segmentation). Our framework provides a principled method for adapting generic algorithms to specific applications. For example, we estimate the optimal weights or cortical folding template of the generic weighted Sum of Squared Differences dissimilarity measure for localizing underlying cytoarchitecture and functional regions of the cerebral cortex. The generality of the framework suggests potential applications to other problems in science and engineering formulated as optimization problems.by B.T. Thomas Yeo.Ph.D

The Organization of Local and Distant Functional Connectivity in the Human Brain

Information processing in the human brain arises from both interactions between adjacent areas and from distant projections that form distributed brain systems. Here we map interactions across different spatial scales by estimating the degree of intrinsic functional connectivity for the local (≤14 mm) neighborhood directly surrounding brain regions as contrasted with distant (>14 mm) interactions. The balance between local and distant functional interactions measured at rest forms a map that separates sensorimotor cortices from heteromodal association areas and further identifies regions that possess both high local and distant cortical-cortical interactions. Map estimates of network measures demonstrate that high local connectivity is most often associated with a high clustering coefficient, long path length, and low physical cost. Task performance changed the balance between local and distant functional coupling in a subset of regions, particularly, increasing local functional coupling in regions engaged by the task. The observed properties suggest that the brain has evolved a balance that optimizes information-processing efficiency across different classes of specialized areas as well as mechanisms to modulate coupling in support of dynamically changing processing demands. We discuss the implications of these observations and applications of the present method for exploring normal and atypical brain function.Psycholog

Cortical Folding Development Study based on Over-Complete Spherical Wavelets

We introduce the use of over-complete spherical wavelets for shape analysis of 2D closed surfaces. Bi-orthogonal spherical wavelets have been shown to be powerful tools in the segmentation and shape analysis of 2D closed surfaces, but unfortunately they suffer from aliasing problems and are therefore not invariant under rotations of the underlying surface parameterization. In this paper, we demonstrate the theoretical advantage of over-complete wavelets over bi-orthogonal wavelets and illustrate their utility on both synthetic and real data. In particular, we show that over-complete spherical wavelets allow us to build more stable cortical folding development models, and detect a wider array of regions of folding development in a newborn dataset

A generative model for image segmentation based on label fusion

We propose a nonparametric, probabilistic model for the automatic segmentation of medical images, given a training set of images and corresponding label maps. The resulting inference algorithms rely on pairwise registrations between the test image and individual training images. The training labels are then transferred to the test image and fused to compute the final segmentation of the test subject. Such label fusion methods have been shown to yield accurate segmentation, since the use of multiple registrations captures greater inter-subject anatomical variability and improves robustness against occasional registration failures. To the best of our knowledge, this manuscript presents the first comprehensive probabilistic framework that rigorously motivates label fusion as a segmentation approach. The proposed framework allows us to compare different label fusion algorithms theoretically and practically. In particular, recent label fusion or multiatlas segmentation algorithms are interpreted as special cases of our framework. We conduct two sets of experiments to validate the proposed methods. In the first set of experiments, we use 39 brain MRI scans - with manually segmented white matter, cerebral cortex, ventricles and subcortical structures - to compare different label fusion algorithms and the widely-used FreeSurfer whole-brain segmentation tool. Our results indicate that the proposed framework yields more accurate segmentation than FreeSurfer and previous label fusion algorithms. In a second experiment, we use brain MRI scans of 282 subjects to demonstrate that the proposed segmentation tool is sufficiently sensitive to robustly detect hippocampal volume changes in a study of aging and Alzheimer's Disease.National Alliance for Medical Image Computing (U.S.) (NIH NIBIB NAMIC U54-EB005149)National Alliance for Medical Image Computing (U.S.) (NAC NIH NCRR NAC P41-RR13218)National Institutes of Health (U.S.) (mBIRN NIH NCRR mBIRN U24-RR021382)National Institutes of Health (U.S.) (NIH NINDS R01-NS051826 grant)National Science Foundation (U.S.) (NSF CAREER 0642971 grant)National Center for Research Resources (U.S.) (P41-RR14075, R01 RR16594-01A1)National Institute of Biomedical Imaging and Bioengineering (U.S.) (R01 EB001550, R01EB006758)National Institute of Neurological Disorders and Stroke (U.S.) (R01 NS052585-01)Mind Research InstituteEllison Medical Foundation (Autism and Dyslexia Project)Singapore. Agency for Science, Technology and ResearchAcademy of Finland (grant number 133611

Spherical Demons: Fast Diffeomorphic Landmark-Free Surface Registration

We present the Spherical Demons algorithm for registering two spherical images. By exploiting spherical vector spline interpolation theory, we show that a large class of regularizors for the modified Demons objective function can be efficiently approximated on the sphere using iterative smoothing. Based on one parameter subgroups of diffeomorphisms, the resulting registration is diffeomorphic and fast. The Spherical Demons algorithm can also be modified to register a given spherical image to a probabilistic atlas. We demonstrate two variants of the algorithm corresponding to warping the atlas or warping the subject. Registration of a cortical surface mesh to an atlas mesh, both with more than 160 k nodes requires less than 5 min when warping the atlas and less than 3 min when warping the subject on a Xeon 3.2 GHz single processor machine. This is comparable to the fastest nondiffeomorphic landmark-free surface registration algorithms. Furthermore, the accuracy of our method compares favorably to the popular FreeSurfer registration algorithm. We validate the technique in two different applications that use registration to transfer segmentation labels onto a new image (1) parcellation of in vivo cortical surfaces and (2) Brodmann area localization in ex vivo cortical surfaces

DT-REFinD: Diffusion Tensor Registration With Exact Finite-Strain Differential

In this paper, we propose the DT-REFinD algorithm for the diffeomorphic nonlinear registration of diffusion tensor images. Unlike scalar images, deforming tensor images requires choosing both a reorientation strategy and an interpolation scheme. Current diffusion tensor registration algorithms that use full tensor information face difficulties in computing the differential of the tensor reorientation strategy and consequently, these methods often approximate the gradient of the objective function. In the case of the finite-strain (FS) reorientation strategy, we borrow results from the pose estimation literature in computer vision to derive an analytical gradient of the registration objective function. By utilizing the closed-form gradient and the velocity field representation of one parameter subgroups of diffeomorphisms, the resulting registration algorithm is diffeomorphic and fast. We contrast the algorithm with a traditional FS alternative that ignores the reorientation in the gradient computation. We show that the exact gradient leads to significantly better registration at the cost of computation time. Independently of the choice of Euclidean or Log-Euclidean interpolation and sum of squared differences dissimilarity measure, the exact gradient achieves better alignment over an entire spectrum of deformation penalties. Alignment quality is assessed with a battery of metrics including tensor overlap, fractional anisotropy, inverse consistency and closeness to synthetic warps. The improvements persist even when a different reorientation scheme, preservation of principal directions, is used to apply the final deformations.Institut national de recherche en informatique et en automatique (France)National Alliance for Medical Image Computing (U.S.) (Grant NIH NIBIB NAMIC U54-EB005149)Neuroimaging Analysis Center (U.S.) (Grant NIH NCRR NAC P41-RR13218)Singapore. Agency for Science, Technology and Researc

Learning Task-Optimal Registration Cost Functions for Localizing Cytoarchitecture and Function in the Cerebral Cortex

Image registration is typically formulated as an optimization problem with multiple tunable, manually set parameters. We present a principled framework for learning thousands of parameters of registration cost functions, such as a spatially-varying tradeoff between the image dissimilarity and regularization terms. Our approach belongs to the classic machine learning framework of model selection by optimization of cross-validation error. This second layer of optimization of cross-validation error over and above registration selects parameters in the registration cost function that result in good registration as measured by the performance of the specific application in a training data set. Much research effort has been devoted to developing generic registration algorithms, which are then specialized to particular imaging modalities, particular imaging targets and particular postregistration analyses. Our framework allows for a systematic adaptation of generic registration cost functions to specific applications by learning the “free” parameters in the cost functions. Here, we consider the application of localizing underlying cytoarchitecture and functional regions in the cerebral cortex by alignment of cortical folding. Most previous work assumes that perfectly registering the macro-anatomy also perfectly aligns the underlying cortical function even though macro-anatomy does not completely predict brain function. In contrast, we learn 1) optimal weights on different cortical folds or 2) optimal cortical folding template in the generic weighted sum of squared differences dissimilarity measure for the localization task. We demonstrate state-of-the-art localization results in both histological and functional magnetic resonance imaging data sets.National Alliance for Medical Image Computing (U.S.) (NIH NIBIB NAMIC U54-EB005149)National Institutes of Health (U.S.) (Grant NIH NINDS R01-NS051826)Neuroimaging Analysis Center (U.S.) (NIH NCRR NAC P41-RR13218)Biomedical Informatics Research Network (NIH NCRR mBIRN U24-RR021382)National Science Foundation (U.S.) (CAREER grant 0642971)National Institute on Aging (AG02238)National Center for Research Resources (U.S.) (P41-RR14075) (R01 RR16594-01A1)National Institute of Biomedical Imaging and Bioengineering (U.S.) (R01 EB001550) (R01EB006758))National Institute of Neurological Disorders and Stroke (U.S.) (R01 NS052585-01)Mental Illness and Neuroscience Discovery (MIND) InstituteEllison Medical Foundation.Singapore. Agency for Science, Technology and Researc

Toward Neurosubtypes in Autism

10.1016/j.biopsych.2020.03.022Biological Psychiatry881111-12